Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties
نویسندگان
چکیده
منابع مشابه
Single machine scheduling with controllable processing times to minimize total tardiness and earliness
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...
متن کاملPermutation Flowshop Scheduling with Earliness and Tardiness Penalties
The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...
متن کاملMachine scheduling with earliness, tardiness and non-execution penalties
The study of scheduling problems with earliness–tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a...
متن کاملSimultaneous Batching and Scheduling for Chemical Processing with Earliness and Tardiness Penalties*
We consider the problem of determining the allocation of demand from different customer orders to production batches and the schedule of resulting batches to minimize the total weighted earliness and tardiness penalties in context of batch chemical processing. The problem is formulated as a mixed-integer nonlinear programming model. An iterative heuristic procedure that makes use of the network...
متن کاملMinimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
Job scheduling has always been a challenging task in modern manufacturing and the most real life scheduling problems which involves multi-criteria and multi-machine environments. In this research our direction is largely motivated by the adoption of the Just-In-Time (JIT) philosophy in parallel machines system, where processing times of jobs are controllable. The goal of this paper is to minimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2009
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170902905995